Lazy Initialization

In computer programming, lazy initialization is the tactic of delaying the creation of an object, the calculation of a value, or some other expensive process until the first time it is needed. It is a kind of lazy evaluation that refers specifically to the instantiation of objects or other resources.

This is typically accomplished by augmenting an accessor method (or property getter) to check whether a private member, acting as a cache, has already been initialized. If it has, it is returned straight away. If not, a new instance is created, placed into the member variable, and returned to the caller just-in-time for its first use.

If objects have properties that are rarely used, this can improve startup speed. Mean average program performance may be slightly worse in terms of memory (for the condition variables) and execution cycles (to check them), but the impact of object instantiation is spread in time ("amortized") rather than concentrated in the startup phase of a system, and thus median response times can be greatly improved.

In multithreaded code, access to lazy-initialized objects/state must be synchronized to guard against race conditions.

The "lazy factory"

In a software design pattern view, lazy initialization is often used together with a factory method pattern. This combines three ideas:
* Using a factory method to create instances of a class ( factory method pattern)
* Storing the instances in a map, and returning the ''same'' instance to each request for an instance with ''same'' parameters ( multiton pattern)
* Using lazy initialization to instantiate the object the first time it is requested (lazy initialization pattern)

Examples

ActionScript 3

The following is an example of a class with lazy initialization implemented in ActionScript:

package examples.lazyinstantiation

Basic use:

package

C

In C, lazy evaluation would normally be implemented inside one function, or one source file, using static variables.

In a function:

#include
#include
#include
#include

struct fruit ;

struct fruit *get_fruit(char *name)

/* Example code */

int main(int argc, char *argv[])

Using one source file instead allows the state to be shared between multiple functions, while still hiding it from non-related functions.

fruit.h:

#ifndef _FRUIT_INCLUDED_
#define _FRUIT_INCLUDED_

struct fruit ;

struct fruit *get_fruit(char *name);
void print_fruit_list(FILE *file);

#endif /* _FRUIT_INCLUDED_ */

fruit.c:

#include
#include
#include
#include
#include "fruit.h"

static struct fruit *fruit_list;
static int seq;

struct fruit *get_fruit(char *name)

void print_fruit_list(FILE *file)

main.c:

#include
#include
#include "fruit.h"

int main(int argc, char *argv[])

C#

In .NET Framework 4.0 Microsoft has included a Lazy class that can be used to do lazy loading.
Below is some dummy code that does lazy loading of Class Fruit

var lazyFruit = new Lazy();
Fruit fruit = lazyFruit.Value;

Here is a dummy example in C#.

The Fruit class itself doesn't do anything here, The class variable _typesDictionary is a Dictionary/Map used to store Fruit instances by typeName.

using System;
using System.Collections;
using System.Collections.Generic;

public class Fruit

class Program

A fairly straightforward 'fill-in-the-blanks' example of a Lazy Initialization design pattern, except that this uses an enumeration for the type

namespace DesignPatterns.LazyInitialization;

public class LazyFactoryObject

C++

This example is in C++.

import std;

class Fruit ;

// static
std::map Fruit::types;

// Lazy Factory method, gets the , Fruit, instance associated with a certain
// , type, . Creates new ones as needed.
Fruit* Fruit::GetFruit(const std::string& type)

// For example purposes to see pattern in action.
void Fruit::PrintCurrentTypes()

int main()

// OUTPUT:
//
// Number of instances made = 1
// Banana
//
// Number of instances made = 2
// Apple
// Banana
//
// Number of instances made = 2
// Apple
// Banana
//

Crystal

class Fruit
private getter type : String
@@types = of String => Fruit

def initialize(@type)
end

def self.get_fruit_by_type(type : String)
@@types ype, , = Fruit.new(type)
end

def self.show_all
puts "Number of instances made: #"
@@types.each do , type, fruit,
puts "#"
end
puts
end

def self.size
@@types.size
end
end

Fruit.get_fruit_by_type("Banana")
Fruit.show_all

Fruit.get_fruit_by_type("Apple")
Fruit.show_all

Fruit.get_fruit_by_type("Banana")
Fruit.show_all

Output:

Number of instances made: 1
Banana
Number of instances made: 2
Banana
Apple
Number of instances made: 2
Banana
Apple

Haxe

This example is in Haxe.

class Fruit
Usage
class Test

Java

This example is in Java.

import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;

public class Program

enum FruitType

class Fruit

Output

Number of instances made = 1
Banana
Number of instances made = 2
Banana
Apple
Number of instances made = 2
Banana
Apple

JavaScript

This example is in JavaScript.

var Fruit = (function() )();

Fruit.getFruit('Apple');
Fruit.printCurrentTypes();
Fruit.getFruit('Banana');
Fruit.printCurrentTypes();
Fruit.getFruit('Apple');
Fruit.printCurrentTypes();

Output

Number of instances made: 1
Apple
Number of instances made: 2
Apple
Banana
Number of instances made: 2
Apple
Banana

PHP

Here is an example of lazy initialization in PHP 7.4:

Python

This example is in Python.

class Fruit:
def __init__(self, item: str):
self.item = item

class FruitCollection:
def __init__(self):
self.items =

def get_fruit(self, item: str) -> Fruit:
if item not in self.items:
self.items tem= Fruit(item)

return self.items tem
if __name__

"__main__":
fruits = FruitCollection()
print(fruits.get_fruit("Apple"))
print(fruits.get_fruit("Lime"))

Ruby

This example is in Ruby, of lazily initializing an authentication token from a remote service like Google. The way that @auth_token is cached is also an example of memoization.

require 'net/http'
class Blogger
def auth_token
@auth_token , , =
(res = Net::HTTP.post_form(uri, params)) &&
get_token_from_http_response(res)
end

# get_token_from_http_response, uri and params are defined later in the class
end

b = Blogger.new
b.instance_variable_get(:@auth_token) # returns nil
b.auth_token # returns token
b.instance_variable_get(:@auth_token) # returns token

Rust

Rust have .

use std::cell::LazyCell;

let lazy = LazyCell::new(, , 42);

Scala

Scala has built-in support for lazy variable initiation.

scala> val x =
Hello
x: Int = 99
scala> lazy val y =
y: Int =
scala> y
Hello!!
res2: Int = 31
scala> y
res3: Int = 31

Smalltalk

This example is in Smalltalk, of a typical accessor method to return the value of a variable using lazy initialization.

height
^height ifNil: eight := 2.0

The 'non-lazy' alternative is to use an initialization method that is run when the object is created and then use a simpler accessor method to fetch the value.

initialize
height := 2.0

height
^height

Note that lazy initialization can also be used in non-object-oriented languages.

Theoretical computer science

In the field of theoretical computer science, lazy initialization (also called a lazy array) is a technique to design data structures that can work with memory that does not need to be initialized. Specifically, assume that we have access to a table ''T'' of ''n'' uninitialized memory cells (numbered from ''1'' to ''n''), and want to assign ''m'' cells of this array, e.g., we want to assign ''T'' 'k_i'':= ''v_i'' for pairs (''k''₁, ''v''₁), ..., (''k_m'', ''v_m'') with all ''k_i'' being different. The lazy initialization technique allows us to do this in just O(''m'') operations, rather than spending O(''m''+''n'') operations to first initialize all array cells. The technique is simply to allocate a table ''V'' storing the pairs (''k_i'', ''v_i'') in some arbitrary order, and to write for each ''i'' in the cell ''T'' 'k_i''the position in ''V'' where key ''k_i'' is stored, leaving the other cells of ''T'' uninitialized. This can be used to handle queries in the following fashion: when we look up cell ''T'' 'k''for some ''k'', we can check if ''T'' 'k''is in the range : if it is not, then ''T'' 'k''is uninitialized. Otherwise, we check ''V'' 'T''[''k'', and verify that the first component of this pair is equal to ''k''. If it is not, then ''T'' 'k''is uninitialized (and just happened by accident to fall in the range ). Otherwise, we know that ''T'' 'k''is indeed one of the initialized cells, and the corresponding value is the second component of the pair.

See also

* Double-checked locking
* Lazy loading
* Proxy pattern
* Singleton pattern

References

External links

* Article
Java Tip 67: Lazy instantiation
- Balancing performance and resource usage" by Philip Bishop and Nigel Warren

Java code examples

Use Lazy Initialization to Conserve Resources

Description from the Portland Pattern Repository



Lazy Inheritance in JavaScript

Lazy Inheritance in C#

{{DEFAULTSORT:Lazy Initialization
Software design patterns
Programming language comparisons

Articles with example C code
Articles with example C++ code
Articles with example C Sharp code
Articles with example Java code
Articles with example JavaScript code
Articles with example PHP code
Articles with example Python (programming language) code
Articles with example Ruby code
Articles with example Smalltalk code